Propagation of Preference Relations in Qualitative Inference Networks
نویسندگان
چکیده
Preference relations can provide a more realistic model of random phenomena than quantita tive probability or belief functions. In order to use preference relations for reasoning under un certainty, it is necessary to perform sequential and parallel combinations of propagated infor mation in a qualitative inference network. This paper discusses the rules for such sequential and parallel combinations.
منابع مشابه
An Introduction to Inference and Learning in Bayesian Networks
Bayesian networks (BNs) are modern tools for modeling phenomena in dynamic and static systems and are used in different subjects such as disease diagnosis, weather forecasting, decision making and clustering. A BN is a graphical-probabilistic model which represents causal relations among random variables and consists of a directed acyclic graph and a set of conditional probabilities. Structure...
متن کاملPrediction of Bubble Point Pressure & Asphaltene Onset Pressure During CO2 Injection Using ANN & ANFIS Models
Although CO2 injection is one of the most common methods in enhanced oil recovery, it could alter fluid properties of oil and cause some problems such as asphaltene precipitation. The maximum amount of asphaltene precipitation occurs near the fluid pressure and concentration saturation. According to the description of asphaltene deposition onset, the bubble point pressure has a very special imp...
متن کاملINCOMPLETE INTERVAL-VALUED HESITANT FUZZY PREFERENCE RELATIONS IN DECISION MAKING
In this article, we propose a method to deal with incomplete interval-valuedhesitant fuzzy preference relations. For this purpose, an additivetransitivity inspired technique for interval-valued hesitant fuzzypreference relations is formulated which assists in estimating missingpreferences. First of all, we introduce a condition for decision makersproviding incomplete information. Decision maker...
متن کاملLazy Propagation in Junction Trees D Lazy Propagation in Junction Trees
The eeciency of algorithms using secondary structures for probabilistic inference in Bayesian networks can be improved by exploiting independence relations induced by evidence and the direction of the links in the original network. In this paper we present an algorithm that exploits the independences relations induced by evidence and the direction of the links in the original network to reduce ...
متن کاملInferring qualitative relations in genetic networks and metabolic pathways
MOTIVATION Inferring genetic network architecture from time series data of gene expression patterns is an important topic in bioinformatics. Although inference algorithms based on the Boolean network were proposed, the Boolean network was not sufficient as a model of a genetic network. RESULTS First, a Boolean network model with noise is proposed, together with an inference algorithm for it. ...
متن کامل